The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes
نویسندگان
چکیده
Nhtsl kninvn clwwes of binory Crror.corrcctirlg cocks h:lvc Iwcn dcsiyrcd for usc on symnwtric ch:innels, i.e.. chonnels for which the error prob;lbilitit’s I ~ O snd O -+ I are cqu:il. IIowcvcr. in ccrlvin applications (e.g.. LSI memory protection (l{cf. I). optic:lt c~)lllttttltlic:llit>n (Ref. 6)). tlw observed errors :Irc highly :Isynlnwtric. and the uppropriistc ch:lntwl model moy in f:wl Iw the Z-ckrnncl. in which the trwlsilion O I is impossible. Of course any code cap:lble of correcl ing t errors ~m ii symnwtric clurntwl will also be cspable of correcting I Z.chantwl crrtm; but at present thtre i$ no entirely sotisf:w. ttlry tccllniquc for chxsling direclly with osymnwtric errors. Cotllp:lr; lblc wy to the llCl lGIppa const rwlion (Ref. 5) for symmetric errors, Recently. however. Constnntin 3nd Rno (l{cf. 1) guve 3n ingenious construction for 3 cksss d Ilinary C(UICS c;IpJIIle d correcting a single asymmetric error. Since ,mr orticlc is b:lscd on theirs, we Iwgin will) 3 akcriplion of lltc ~..R. COdCS.
منابع مشابه
New lower bounds and constructions for binary codes correcting asymmetric errors
In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...
متن کاملTitle New lower bounds and constructions for binary codes correcting asymmetric errors
In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...
متن کاملOn Group-Theoretic Codes for Asymmetric Channels TOR HELLESETH AND TORLEIV KLOVE
We study single error-correcting codes for the asymmetric channel with input and output alphabets being {0, 1 ..... a 1/. From an abe|ian group G of order N with elements go = O, gl ..... gN 1, Constantin and Rao (1979, Inform. Contr. 40, 20-36) define Vg = {(b~, b2 ..... bN1) C {0, 1 ..... a -1 }N-I I Z~-,' b~gi = g} and show that Vg correct single errors. We give explicit expressions for the ...
متن کاملOn the structure of non-full-rank perfect codes
On the structure of non-full-rank perfect codes Denis S. Krotov Sobolev Institute of Mathematics and Mechanics and Mathematics Department, Novosibirsk State University Novosibirsk, Russia The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-errorcorrecting binary code can be constructed by this co...
متن کاملError-correcting codes and Bh-sequences
We construct error-correcting (nonlinear) binary codes using a construction of Bose and Chowla in additive number theory. Our method extends a construction of Graham and Sloane for constant weight codes. The new codes improve 1028 of the 7168 best known h-error correcting codes of wordlength ≤ 512 with 1 ≤ h ≤ 14. We give asymptotical comparisons to shortened BCH codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information and Control
دوره 44 شماره
صفحات -
تاریخ انتشار 1980